RWTH Aachen University

Results: 580



#Item
121

Proving Java Termination: Reducing the Ugly to the Bad Marc Brockschmidt LuFG Informatik 2, RWTH Aachen University, Germany September 2012

Add to Reading List

Source URL: verify.rwth-aachen.de

Language: English - Date: 2015-04-16 09:49:59
    122

    Automated Detection of Non-Termination and NullPointerExceptions for Java Bytecode? Marc Brockschmidt, Thomas Str¨oder, Carsten Otto, and J¨ urgen Giesl LuFG Informatik 2, RWTH Aachen University, Germany

    Add to Reading List

    Source URL: verify.rwth-aachen.de

    Language: English - Date: 2015-04-16 09:49:59
      123

      Automated Detection of Non-Termination and NullPointerExceptions for Java Bytecode? Marc Brockschmidt, Thomas Str¨oder, Carsten Otto, and J¨ urgen Giesl LuFG Informatik 2, RWTH Aachen University, Germany

      Add to Reading List

      Source URL: verify.rwth-aachen.de

      Language: English - Date: 2015-04-16 09:49:59
        124

        Automated Termination Proofs for Java Bytecode with Cyclic Data M. Brockschmidt, R. Musiol, C. Otto, J. Giesl LuFG Informatik 2, RWTH Aachen University, Germany WST 2012, Obergurgl

        Add to Reading List

        Source URL: verify.rwth-aachen.de

        Language: English - Date: 2015-04-16 09:49:59
          125

          Optimal Base Encodings for Pseudo-Boolean Constraints? Michael Codish1 , Yoav Fekete1 , Carsten Fuhs2 , and Peter Schneider-Kamp3 1 Department of Computer Science, Ben Gurion University of the Negev, Israel

          Add to Reading List

          Source URL: verify.rwth-aachen.de

          Language: English - Date: 2015-04-16 09:50:00
            126

            Efficiently Using Prefix-trees in Mining Frequent Itemsets G¨osta Grahne and Jianfei Zhu Concordia University Montreal, Canada {grahne, j zhu}@cs.concordia.ca Abstract

            Add to Reading List

            Source URL: sunsite.informatik.rwth-aachen.de

            Language: English - Date: 2003-11-14 14:09:50
              127

              Synthesizing Shortest Linear Straight-Line Programs over GF(2) using SAT⋆ Carsten Fuhs1 and Peter Schneider-Kamp2 1 LuFG Informatik 2, RWTH Aachen University, Germany

              Add to Reading List

              Source URL: verify.rwth-aachen.de

              Language: English - Date: 2015-04-16 09:50:00
                128

                Efficient Implementations of Apriori and Eclat Christian Borgelt Department of Knowledge Processing and Language Engineering School of Computer Science, Otto-von-Guericke-University of Magdeburg Universit¨atsplatz 2, 39

                Add to Reading List

                Source URL: sunsite.informatik.rwth-aachen.de

                Language: English - Date: 2003-11-14 14:16:04
                  129

                  Proving Termination of Heap-Manipulating Java Programs Marc Brockschmidt LuFG Informatik 2, RWTH Aachen University, Germany March 2013

                  Add to Reading List

                  Source URL: verify.rwth-aachen.de

                  Language: English - Date: 2015-04-16 09:49:59
                    130

                    Automated Termination Proofs for Java Programs with Cyclic Data M. Brockschmidt, R. Musiol, C. Otto, J. Giesl LuFG Informatik 2, RWTH Aachen University, Germany CAV 2012

                    Add to Reading List

                    Source URL: verify.rwth-aachen.de

                    Language: English - Date: 2015-04-16 09:49:59
                      UPDATE